Solution to Sylvester equation associated to linear descriptor systems
نویسنده
چکیده
This paper presents the solution of the constrained Sylvester equation associated to linear descriptor systems. This problem has been recently studied in [1], where sufficient conditions for the existence of the solution are given. In the present paper, a simple and direct method is developed to solve this problem. This method shows that the conditions given in [1] are necessary and sufficient.
منابع مشابه
Optimal Control for Descriptor Systems: Tracking Problem (RESEARCH NOTE)
Singular systems have been studied extensively during the last two decades due Abstract to their many practical applications. Such systems possess numerous properties not shared by the well-known state variable systems. This paper considers the linear tracking problem for the continuous-time singular systems. The Hamilton-Jacobi theory is used in order to compute the optimal control and associa...
متن کاملOn the solving of matrix equation of Sylvester type
A solution of two problems related to the matrix equation of Sylvester type is given. In the first problem, the procedures for linear matrix inequalities are used to construct the solution of this equation. In the second problem, when a matrix is given which is not a solution of this equation, it is required to find such solution of the original equation, which most accurately approximates the ...
متن کاملDesign of PD Observers in Descriptor Linear Systems
A class of new observers in descriptor linear systems, proportional-derivative (PD) observers, are proposed. A parametric design approach for such observers is proposed based on a complete parametric solution to the generalized Sylvester matrix equation. The approach provides complete parameterizations for all the observer gains, gives the parametric expression for the corresponding left eigenv...
متن کاملAn efficient algorithm for the solution of a coupled Sylvester equation appearing in descriptor systems
Descriptor systems consisting of a large number of differential-algebraic equations (DAEs) usually arise from the discretization of partial differential-algebraic equations. This paper presents an efficient algorithm for solving the coupled Sylvester equation that arises in converting a system of linear DAEs to ordinary differential equations. A significant computational advantage is obtained b...
متن کاملParametric solutions to the generalized discrete Sylvester matrix equation MXN - X = TY and their applications
In this paper, an explicit, analytical and complete solution to the generalized discrete Sylvester matrix equation M X N − X = T Y which is closely related with several types of matrix equations in control theory is obtained. The proposed solution has a neat and elegant form in terms of the Krylov matrix, a block Hankel matrix and an observability matrix. Based on the proposed solution, an expl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Systems & Control Letters
دوره 55 شماره
صفحات -
تاریخ انتشار 2006